Search results for "Computer Science::Computational Geometry"
showing 10 items of 70 documents
"Table 49" of "Multiplicity dependence of K*(892)$^{0}$ and $\phi$(1020) production in pp collisions at $\sqrt{s}$ = 13 TeV"
2020
$\phi$/K$_{\mathrm{S}}^{0}$ yield ratio vs transverse momentum - V0M multiplicity class II
"Table 52" of "Multiplicity dependence of K*(892)$^{0}$ and $\phi$(1020) production in pp collisions at $\sqrt{s}$ = 13 TeV"
2020
$\phi$/K$_{\mathrm{S}}^{0}$ double yield ratio vs transverse momentum - V0M multiplicity class II / V0M multiplicity class X
"Table 54" of "Multiplicity dependence of K*(892)$^{0}$ and $\phi$(1020) production in pp collisions at $\sqrt{s}$ = 13 TeV"
2020
Significance of $\phi$/K$_{\mathrm{S}}^{0}$ double yield ratio vs transverse momentum - V0M multiplicity class II / V0M multiplicity class X
"Table 20" of "Multiplicity dependence of K*(892)$^{0}$ and $\phi$(1020) production in pp collisions at $\sqrt{s}$ = 13 TeV"
2020
$\phi$ transverse momentum spectrum - V0M multiplicity class II
"Table 30" of "Multiplicity dependence of K*(892)$^{0}$ and $\phi$(1020) production in pp collisions at $\sqrt{s}$ = 13 TeV"
2020
$\phi$ transverse momentum spectrum ratio to INEL>0 - V0M multiplicity class II
Ein Axiomensystem f�r partielle affine R�ume
1994
A partial linear space with parallelism is called partial affine space if it is embeddable in an affine space with the same pointset preserving the parallelism. These partial affine spaces will be characterized by a system of three axioms for partial linear spaces with parallelism.
Optimal Guard Placement Problem Under L-Visibility
2006
Two points a and b in the presence of polygonal obstacles are L-visible if the length of the shortest path avoiding obstacles is no more than L. For a given convex polygon Q, Gewali et al [4]. addressed the guard placement problem on the exterior boundary that will cover the maximum area exterior to the polygon under L-visibility. They proposed a linear time algorithm for some given value of L. When the length L is greater than half of the perimeter, they declared that problem as open. Here we address that open problem and present an algorithm whose time complexity is linear in number of vertices of the polygon.
"Table 23" of "Energy dependence of event shapes and of alpha(s) at LEP-2."
1999
Distributions of Planarity at cm energies 133, 161 and 172 GeV.
"Table 24" of "Energy dependence of event shapes and of alpha(s) at LEP-2."
1999
Distribution of Planarity at cm energy 183 GeV.
"README and Table of Contents" of "Search for trilepton resonances from chargino and neutralino pair production in $\sqrt{s}$ = 13 TeV $pp$ collision…
2021
This is the HEPData space for the trilepton resonance wino search, the full resolution figures can be found here https://atlas.web.cern.ch/Atlas/GROUPS/PHYSICS/PAPERS/SUSY-2018-36/. The full statistical likelihoods have been provided for this analysis. They can be downloaded by clicking on the purple 'Resources' buttun above where they can then be found in the 'Common Resources' area. A detailed README for how to use the likelihoods is also included in this download. Exclusion contours: Obs. data vs SM bkg. exp. in CRs and VRs $\ell=(e, \mu, \tau)$, Obs_0 $\ell=(e, \mu, \tau)$, Obs_0_Up $\ell=(e, \mu, \tau)$, Obs_0_Down $\ell=(e, \mu, \tau)$, Exp_0 $\ell=(e, \mu, \tau)$, Exp_0_Up $\ell=(e, …